Coping with Time-Varying Demand When Setting Staffing Requirements for a Service System
نویسندگان
چکیده
W review queueing-theory methods for setting staffing requirements in service systems where customer demand varies in a predictable pattern over the day. Analyzing these systems is not straightforward, because standard queueing theory focuses on the long-run steady-state behavior of stationary models. We show how to adapt stationary queueing models for use in nonstationary environments so that time-dependent performance is captured and staffing requirements can be set. Relatively little modification of straightforward stationary analysis applies in systems where service times are short and the targeted quality of service is high. When service times are moderate and the targeted quality of service is still high, time-lag refinements can improve traditional stationary independent period-by-period and peak-hour approximations. Time-varying infinite-server models help develop refinements, because closed-form expressions exist for their time-dependent behavior. More difficult cases with very long service times and other complicated features, such as end-of-day effects, can often be treated by a modified-offered-load approximation, which is based on an associated infinite-server model. Numerical algorithms and deterministic fluid models are useful when the system is overloaded for an extensive period of time. Our discussion focuses on telephone call centers, but applications to police patrol, banking, and hospital emergency rooms are also mentioned.
منابع مشابه
What You Should Know About Queueing Models To Set Staffing Requirements in Service Systems
One traditional application of queueing models is to help set staffing requirements in service systems, but the way to do so is not entirely straightforward, largely because demand in service systems typically varies greatly by the time of day. This paper discusses ways old and new to cope with that time-varying demand.
متن کاملOffered Load Analysis for Staffing
This essay, based on my 2012 MSOM Fellow Lecture, discusses an idea that has been useful for developing effective methods to set staffing levels in service systems: offered load analysis. The main idea is to tackle a hard problem by first seeking an insightful simplification. For capacity planning to meet uncertain exogenous demand, offered load analysis looks at the amount of capacity that wou...
متن کاملControlling excessive waiting times in small service systems with time-varying demand: An extension of the ISA algorithm
In many service systems, the arrival pattern is not constant throughout the day. This raises the question how staffing decisions should be adapted in view of controlling customer’s waiting times. Assuming a single-stage queueing system with general abandonment and service times and time-varying demand for service, we suggest a method inspired by the simulation-based Iterative Staffing Algorithm...
متن کاملQueueing Inventory System in a Two-level Supply Chain with One-for-One Ordering Policy
Consider a two-level inventory system consisting of one supplier and one retailer. The retailer faces a Poisson demand with a known rate and applies base stock (one-for-one ordering) policy. That is, his inventory position is set to a pre-determined level, so the demand pattern is transferred exactly to the supplier. The supplier has an inventory system and a service unit with exponentially dis...
متن کاملThe Erlang-R Queue: Time-Varying QED Queues with Reentrant Customers in Support of Healthcare Staffing
Extended Abstract for the MSOM 2010 Conference. Extended Abstract for the MSOM 2010 Conference. We develop and analyze a queueing model that we call Erlang-R, where the " R " stands for ReEntrant customers. The Erlang-R model accommodates customers that return to service several times during their sojourn within the system. It is most significant in time-varying environments. Indeed, it was mot...
متن کامل